Digital Image Segmentation Using Delaunay Triangulation Algorithm
نویسندگان
چکیده
منابع مشابه
Vector-based Medical Image Segmentation Using Adaptive Delaunay Triangulation
The image segmentation plays an important role in medical image processing. Many segmentation algorithms exist. Most of them produce raster data which is not suitable for further 3D geometrical modeling of tissues. In this paper, a vector segmentation algorithm based on an adaptive Delaunay triangulation is proposed. Triangular meshes are used to divide an image into several non-overlapping reg...
متن کاملSkin lesion image segmentation using Delaunay Triangulation for melanoma detection
Developing automatic diagnostic tools for the early detection of skin cancer lesions in dermoscopic images can help to reduce melanoma-induced mortality. Image segmentation is a key step in the automated skin lesion diagnosis pipeline. In this paper, a fast and fully-automatic algorithm for skin lesion segmentation in dermoscopic images is presented. Delaunay Triangulation is used to extract a ...
متن کاملA Quick Image Registration Algorithm Based on Delaunay Triangulation
The traditional image matching algorithms adopt more complex strategies when dealing with mismatch caused by a lot of noise. In this paper, a simple, intuitive and effective noise processing algorithm is proposed based on Delaunay triangulation in computational geometry. The algorithm extracts feature points using SIFT method, respectively establishes Delaunay triangulation in multi-spectral an...
متن کاملAutomated Photogrammetric Image Matching with Sift Algorithm and Delaunay Triangulation
An algorithm for image matching of multi-sensor and multi-temporal satellite images is developed. The method is based on the SIFT feature detector proposed by Lowe in (Lowe, 1999). First, SIFT feature points are detected independently in two images (reference and sensed image). The features detected are invariant to image rotations, translations, scaling and also to changes in illumination, bri...
متن کاملConstrained Delaunay Triangulation Using Delaunay Visibility
An algorithm for constructing constrained Delaunay triangulation (CDT) of a planar straight-line graph (PSLG) is presented. Although the uniform grid method can reduce the time cost of visibility determinations, the time needed to construct the CDT is still long. The algorithm proposed in this paper decreases the number of edges involved in the computation of visibility by replacing traditional...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: NIGERIAN ANNALS OF PURE AND APPLIED SCIENCES
سال: 2020
ISSN: 2705-3997,2682-6623
DOI: 10.46912/napas.83